Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints

Polynomial optimization problem with second-order cone complementarity constraints (SOCPOPCC) is a special case of mathematical program (SOCMPCC). In this paper, we consider how to apply Lasserre's type semidefinite relaxation method solve SOCPOPCC. To end, first reformulate SOCPOPCC equivalently as polynomial and then the reformulated method. For SOCPOPCC, present another reformulation optimization, which lower degree. SDP applied new optimization. Numerical examples are reported show efficiency our proposed